Monotone Confounding, Monotone Treatment Selection and Monotone Treatment Response
نویسندگان
چکیده
منابع مشابه
Monotone Confounding, Monotone Treatment Selection and Monotone Treatment Response.
Manski (1997) and Manski and Pepper (2000) gave sharp bounds on causal effects under the assumptions of monotone treatment response (MTR) and monotone treatment selection (MTS). VanderWeele (2008) provided bounds for binary treatment under an assumption of monotone confounding (MC). We discuss the relation between MC and MTS and provide bounds under various combinations of these assumptions. We...
متن کاملMonotone and Near-Monotone Systems
This paper provides an expository introduction to monotone and nearmonotone biochemical network structures. Monotone systems respond in a predictable fashion to perturbations, and have very robust dynamical characteristics. This makes them reliable components of more complex networks, and suggests that natural biological systems may have evolved to be, if not monotone, at least close to monoton...
متن کاملMonotone Operations and Monotone Groups∗
We survey an algebraic approach to proving impossibility results in distributed computing. The approach is emerging around monotone groups, a new class of algebraic groups we define here as a tight suit to monotone Read&Modify&Write (or RMW) operations in a distributed system. The yields of this approach have been the first impossibility results for implementations of monotone RMW operations th...
متن کاملMonotone and near-monotone network structure
This paper provides an expository introduction to monotone and near-monotone biochemical network structures. Monotone systems respond in a predictable fashion to perturbations, and have very robust dynamical characteristics. This makes them reliable components of more complex networks, and suggests that natural biological systems may have evolved to be, if not monotone, at least close to monoto...
متن کاملFr{'e}chet and Hausdorff Queries on $x$-Monotone Trajectories
vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $epsilon >0$. We show how to preprocess $pi$ and $epsilon$ into a data structure such that for any horizontal query segment $Q$ in the plane, one can quickly determine the minimal continuous fraction of $pi$ whose Fr{'e}chet and Hausdo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Causal Inference
سال: 2014
ISSN: 2193-3677,2193-3685
DOI: 10.1515/jci-2012-0006